Book Review: Combinatorial optimization: networks and matroids
نویسندگان
چکیده
منابع مشابه
Introduction to Combinatorial Optimization in Matroids
1. Matroids and Examples . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .1 2. Greedy Algorithm and Matroids . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .13 3. Duality, Minors and Constructions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ....
متن کاملConsidering Stochastic and Combinatorial Optimization
Here, issues connected with characteristic stochastic practices are considered. In the first part, the plausibility of covering the arrangements of an improvement issue on subjective subgraphs is studied. The impulse for this strategy is a state where an advancement issue must be settled as often as possible for discretionary illustrations. Then, a preprocessing stage is considered that would q...
متن کاملCombinatorial Optimization in Communication Networks
2 Performance Benefits from Multipath Routing 4 2.1 Reliability . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 2.2 Load/Energy Consumption Balancing . . . . . . . . . . . . . . . . . . . 7 2.3 Routing Overhead . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 2.4 Quality of Service (QoS) . . . . . . . . . . . . . . . . . . . . . . . . . . 8 2.5 Security . . . ...
متن کاملCombinatorial batch codes and transversal matroids
Combinatorial batch codes were defined by Paterson, Stinson, and Wei as purely combinatorial versions of the batch codes introduced by Ishai, Kushilevitz, Ostrovsky, and Sahai. There are n items and m servers each of which stores a subset of the items. It is required that, for prescribed integers k and t, any k items can be retrieved by reading at most t items from each server. Only the case t ...
متن کاملProphet Secretary for Combinatorial Auctions and Matroids
The secretary and the prophet inequality problems are central to the field of Stopping Theory. Recently, there has been a lot of work in generalizing these models to multiple items because of their applications in mechanism design. The most important of these generalizations are to matroids and to combinatorial auctions (extends bipartite matching). Kleinberg-Weinberg [KW12] and Feldman et al. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the American Mathematical Society
سال: 1978
ISSN: 0002-9904
DOI: 10.1090/s0002-9904-1978-14493-0